منابع مشابه
Towards M-Adhesive Categories based on Coalgebras and Comma Categories
In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we define edges that are incident to edges. Since we use coalgebraic constructions we refer to these graphs as corecursive graphs. The superpower set functors are ex...
متن کاملOn monotone modalities and adjointness
We fix a logical connection (Stone Pred : Set op −→ BA given by 2 as a schizophrenic object) and study coalgebraic modal logic that is induced by a functor T : Set −→ Set which is finitary, standard, preserves weak pullbacks and finite sets. We prove that for any such T , the cover modality nabla is a left (and its dual delta is a right) adjoint relative to Pω. We then consider monotone unary m...
متن کاملModes of Adjointness
The fact that many modal operators are part of an adjunction is probably folklore since the discovery of adjunctions. On the other hand, the natural idea of a minimal propositional calculus extended with a pair of adjoint operators seems to have been formulated only very recently. This recent research, mainly motivated by applications in computer science, concentrates on technical issues relate...
متن کاملThe white ‘comma’ as a distractive mark on the wings of comma butterflies
0003-3472 2013 The Authors. Published on behalf http://dx.doi.org/10.1016/j.anbehav.2013.10.003 Distractive marks have been suggested to prevent predator detection or recognition of a prey, by drawing the attention away from recognizable traits of the bearer. The white ‘comma’ on the wings of comma butterflies, Polygonia c-album, has been suggested to represent such a distractive mark. In a lab...
متن کاملRestrictions and Generalizations on Comma-Free Codes
A significant sector of coding theory is that of comma-free coding; that is, codes which can be received without the need of a letter used for word separation. The major difficulty is in finding bounds on the maximum number of comma-free words which can inhabit a dictionary. We introduce a new class called a self-reflective comma-free dictionary and prove a series of bounds on the size of such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications, Faculty Of Science, University of Ankara Series A1Mathematics and Statistics
سال: 1961
ISSN: 1303-5991
DOI: 10.1501/commua1_0000000104